Since each iteration in the generalized method will usually skip over a number of extreme points, the convergence rate is obviously quicker than that in simplex method. 由于广义方法的迭代通常要跳过一些极点,因此收敛速度比单纯形法有明显的提高。
A Generalized Dual Simplex Method 广义对偶单纯形方法
Generalized Simplex Method of Linear Programming Problem 线性规划问题的广义单纯形法
This paper discusses linear programming problems with generalized bounded variables. With the help of the technique of simplex method for standard constrained linear programming, a direct dual simplex method for the discussed problems is presented. 本文讨论变量有广义界线性规划问题借助标准形线性规划同单纯形法技术,建立问题的一个直接对偶单纯形法。
This method is called Generalized Simplex Method. 此法称之为广义单纯形法。